New Coloured Reductions for Software Validation
نویسندگان
چکیده
Structural model abstraction is a powerful technique for reducing the complexity of a state based enumeration analysis. We present in this paper accurate reductions for high-level Petri nets based on new ordinary Petri nets reductions. These reductions involve only structural and algebraical conditions. They preserve the liveness of the net and any LTL formula that does not observe the reduced transitions of the net. The mixed use of structural and algebraical conditions significantly enlarges their application area. Furthermore the specification of the transformation is parametric with respect to the cardinalities of coloured domains.
منابع مشابه
Specifying Software Architectures Based on Coloured Petri Nets
The quality of an architectural design of a software system has a great influence on achieving non-functional requirements to the system, so formal evaluation and validation techniques to designed architectures are necessary in the early phase of development processes. In this paper, we present a technique for describing software architectures formally based on Coloured Petri Nets (CPNs) and a ...
متن کاملWeb-Server Systems HTCPNs-Based Development Tool Application in Load Balance Modelling
A new software tool for web–server systems development is presented. The tool consist of a set of predefined Hierarchical Timed Coloured Petri Net (HTCPN) structures – patterns. The patterns make it possible to naturally construct typical and experimental server–systems structures. The preliminary patterns are executable queueing systems. A simulation based methodology of web–server model analy...
متن کاملHTCPNs-Based Tool for Web-Server Clusters Development
A new software tool for web–server clusters development is presented. The tool consist of a set of predefined Hierarchical Timed Coloured Petri Net (HTCPN) structures – patterns. The patterns make it possible to naturally construct typical and experimental server–cluster structures. The preliminary patterns are executable queueing systems. A simulation based methodology of web–server model anal...
متن کاملComplexity of the Bollobás-Riordan Polynomial
The coloured Tutte polynomial by Bollobás and Riordan is, as a generalisation of the Tutte polynomial, the most general graph polynomial for coloured graphs that satisfies certain contractiondeletion identities. Jaeger, Vertigan, and Welsh showed that the classical Tutte polynomial is #P-hard to evaluate almost everywhere by establishing reductions along curves and lines. We establish a similar...
متن کاملValidation and Verification of Software Systems Using Virtual Reality and Coloured Petri Nets
Validation and verification techniques have been identified as suitable mechanisms to determine if the software meets the needs of the user and to verify if the software works correctly. However, the existing verification techniques do not support friendly visualization. Also, validation techniques with friendly visualization mechanisms do not allow the verification of the system’s correctness....
متن کامل